n, m = map(int, input().split())
debts = [0] * n
for _ in range(m):
minus, plus, value = map(int, input().split())
debts[minus - 1] -= value
debts[plus - 1] += value
print(sum([debt for debt in debts if debt > 0]))
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long n,m;
cin>>n>>m;
map<long long,long long>mp;
for(int i=0;i<m;i++)
{
long long x,y,z;
cin>>x>>y>>z;
mp[x]-=z;
mp[y]+=z;
}
long long ans=0;
for(auto it:mp)
{
if(it.second>=0)
{
ans+=it.second;
}
}
cout<<ans;
}
1574A - Regular Bracket Sequences | 1574B - Combinatorics Homework |
1567A - Domino Disaster | 1593A - Elections |
1607A - Linear Keyboard | EQUALCOIN Equal Coins |
XOREQN Xor Equation | MAKEPAL Weird Palindrome Making |
HILLSEQ Hill Sequence | MAXBRIDGE Maximise the bridges |
WLDRPL Wildcard Replacement | 1221. Split a String in Balanced Strings |
1002. Find Common Characters | 1602A - Two Subsequences |
1555A - PizzaForces | 1607B - Odd Grasshopper |
1084A - The Fair Nut and Elevator | 1440B - Sum of Medians |
1032A - Kitchen Utensils | 1501B - Napoleon Cake |
1584B - Coloring Rectangles | 1562B - Scenes From a Memory |
1521A - Nastia and Nearly Good Numbers | 208. Implement Trie |
1605B - Reverse Sort | 1607C - Minimum Extraction |
1604B - XOR Specia-LIS-t | 1606B - Update Files |
1598B - Groups | 1602B - Divine Array |